Coding theorems for correlated sources with cooperative encoding
نویسندگان
چکیده
This thesis deals with multiterminal source coding problems for a general framework of coding systems, called coding systems with cooperation, where there are some linkages among encoders and decoders. Especially, the main focus of this thesis is encoder cooperation. Two types of coding systems are investigated that incorporate encoder cooperation: the Slepian-Wolf coding system with linkages (called the SWL system) and the complementary delivery coding system. The SWL system involves some mutual linkages between two encoders of the coding system investigated by Slepian and Wolf (called the SW system) that involves two separate encoders and one common decoder. Especially, some special cases are considered, where the coding rate for the mutual linkage between two encoders is negligibly small. The main results in this thesis shows that the achievable rate region of the SWL system equals that of the SW system when considering fixed-length coding, while weak variable-length coding makes the achievable rate region of the SWL system larger than that of the SW system. This implies that encoder cooperation may improve the coding rate. The complementary delivery coding system contrasts with the SW system in the sense of cooperation, which means that the complementary delivery coding system consists of a common encoder and separate decoders, while the SW system includes separate encoders and a common decoder. Especially, in the complementary delivery coding system, each decoder has access to some of encoded messages to enable the decoder to reproduce the other messages from a common codeword emitted from the common encoder. First, the minimum achievable rate for lossy coding is clarified, which implies that encoder cooperation may increase the coding rate. Next, universal coding schemes for lossless coding are proposed. Explicit constructions of universal lossless codes and the bounds of the error probabilities are clarified by using methods of types and the graph-theoretical analysis.
منابع مشابه
On Linear Coding over Finite Rings and Applications to Computing
This paper presents a coding theorem for linear coding over finite rings, in the setting of the Slepian–Wolf source coding problem. This theorem covers corresponding achievability theorems of Elias (IRE Conv. Rec. 1955, 3, 37–46) and Csiszár (IEEE Trans. Inf. Theory 1982, 28, 585–592) for linear coding over finite fields as special cases. In addition, it is shown that, for any set of finite cor...
متن کاملSeparation Theorems for Phase-Incoherent Multiple-User Channels
We study the transmission of two correlated and memoryless sources (U, V ) over several multipleuser phase asynchronous channels. Namely, we consider a class of phase-incoherent multiple access relay channels (MARC) with both non-causal and causal unidirectional cooperation between encoders, referred to as phase-incoherent unidirectional non-causal cooperative MARC (PI-UNCC-MARC), and phase-inc...
متن کاملDistributed Joint Source-Channel Coding for arbitrary memoryless correlated sources and Source coding for Markov correlated sources using LDPC codes
In this paper, we give a distributed joint source channel coding scheme for arbitrary correlated sources for arbitrary point in the Slepian-Wolf rate region, and arbitrary link capacities using LDPC codes. We consider the Slepian-Wolf setting of two sources and one destination, with one of the sources derived from the other source by some correlation model known at the decoder. Distributed enco...
متن کاملSlepian-Wolf Coding Over Cooperative Relay Networks
This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay network. Necessary conditions with cut-set interpretation are presented. A Joint source-Wyner-Ziv encoding/sliding window decoding scheme is proposed, in which decoding at each receiver is done with respect to an ordered partition of other nodes. For each ordered par...
متن کاملGroup-Theoretic Construction and Analysis of Generalized Coset Codes for Symmetric/asymmetric Distributed Source Coding.
Group-theoretic construction and analysis of generalized coset codes for symmetric/asymmetric distributed source coding. Abstract | In this paper we consider the problem of distributed source coding with symmetric and asym-metric rates of transmission with a constructive and practical approach, referred to as DIstributed Source Coding Using Syndromes (DISCUS). We employ generalized coset codes ...
متن کاملچند پخشی اطلاعات ویدئویی کدشده باH.264 درشبکه های ناهمگن مبتنی بر کدینگ منابع چند پایانه ای
In MTSC, correlated sources are separately encoded but jointly decoded. With appropriate modeling of all kinds of correlation among three non binary correlated sources, in this paper we propose a method for performing IMTSC among three sources. Due to the possibility of providing an approach for practical code design for more than two correlated sources in IMTSC/CEO setup, the multicast system ...
متن کامل